Maximum induced matchings close to maximum matchings
نویسندگان
چکیده
منابع مشابه
Maximum induced matchings in graphs
We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.
متن کاملMaximum Locally Stable Matchings
Motivated by the observation that most companies are more likely to consider job applicants suggested by their employees than those who apply on their own, Arcaute and Vassilvitskii modeled a job market that integrates social networks into stable matchings in an interesting way. We call their model HR+SN because an instance of their model is an ordered pair (I,G) where I is a typical instance o...
متن کاملMaximum Induced Matchings of Random Cubic Graphs
We present a heuristic for finding a large induced matching of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using differential equations and obtain a lower bound on the expected size of the induced matching, M, returned by the algorithm. A corresponding upper bound is derived by means of a direct expectation argument. We ...
متن کاملMaximum Matchings via Glauber Dynamics
In this paper we study the classic problem of computing a maximum cardinality matching in general graphs G = (V,E). This problem has been studied extensively more than four decades. The best known algorithm for this problem till date runs in O(m √ n) time due to Micali and Vazirani [24]. Even for general bipartite graphs this is the best known running time (the algorithm of Karp and Hopcroft [1...
متن کاملSearching Randomly for Maximum Matchings
Many real-world optimization problems in, e. g., engineering or biology have the property that not much is known about the function to be optimized. This excludes the application of problem-specific algorithms. Simple randomized search heuristics are then used with surprisingly good results. In order to understand the working principles behind such heuristics, they are analyzed on combinatorial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.04.001